Polynomial certificates for propositional classes
نویسندگان
چکیده
منابع مشابه
Polynomial Certificates for Propositional Classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding the number of queries that are required to learn the class ignoring computational complexity. This quantity is known to be captured by a combinatorial measure of concept classes known as the certificate complexity. The p...
متن کاملExtended Resolution as Certificates for Propositional Logic
When checking answers coming from automatic provers, or when skeptically integrating them into proof assistants, a major problem is the wide variety of formats of certificates, which forces to write lots of different checkers. In this paper, we propose to use the extended resolution as a common format for every propositional prover. To be able to do this, we detail two algorithms transforming p...
متن کاملPropositional Logic for Circuit Classes
By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained where heights of derivations correspond to heights of appropriate circuits. Adding an uninterpreted predicate on bit-strings (analog to an oracle in relativised complexity classes) this statement can be made precise in the sense ...
متن کاملAbout one class polynomial problems with not polynomial certificates
About one class polynomial problems with not polynomial certificates Kochkarev B.S. Abstract. We build a class of polynomial problems with not polynomial certificates. The parameter concerning which are defined efficiency of corresponding algorithms is the number n of elements of the set has used at construction of combinatory objects (families of subsets) with necessary properties. Let Σ = {0,...
متن کاملHeuristic Certificates using Polynomial Time Approximation Schemes
Artificial Intelligence (AI) is a field of science and engineering concerned with the computational understanding of what is commonly called intelligent behavior, and with the creation of artifacts that exhibit such behavior. The idea behind heuristic search is to search through various nodes which represent possible states for a given problem in an efficient manner to reduce the number of node...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2006
ISSN: 0890-5401
DOI: 10.1016/j.ic.2006.03.001